Published in : in Special Issue of {em Parallel Processing Letters} on "parallelization Techniques for Uniform Algorithms", Transformation of Nested Loops with modulo Indexing to Aane Recurrences

نویسندگان

  • Florin Balasa
  • Frank H.M. Franssen
  • Francky V.M. Catthoor
  • Hugo J. De Man
چکیده

For multi-dimensional (M-D) signal and data processing systems , transformation of algorithmic speciications is a major instrument both in code optimization and code generation for parallelizing compilers and in control ow optimization as a pre-processor for architecture synthesis. State-of-the-art transformation techniques are limited to aane index expressions. This is however not suucient for many important applications in image , speech and numerical processing. In this paper, a novel transformation method is introduced, oriented to the subclass of algorithm speciications that contains modulo expressions of aane functions to index M-D signals. The method employs extensively the concept of Hermite normal form. The transformation method can be carried out in polynomial time, applying only integer arithmetic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)

Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...

متن کامل

Simple Code Generation for special UDLs

This paper focuses on transforming sequential perfectly nested loops into their equivalent parallel form. A special category of FOR nested loops is the uniform dependence loops (UDLs), which yield efficient parallelization techniques. An automatic code generation tool for shared and distributed memory machines, has been developed in order to automatically parallelize these perfectly nested loop...

متن کامل

Scheduling Nested Loops with the Least Number of Processors

Frequently the most computationally intensive part of a program is attributed to the nested loops it contains. It is therefore of interest to try to parallelize the nested loops in order to reduce the overall computation time. A special category of FOR(DO) nested loops are the uniform dependence loops, which yield efficient parallelization techniques and are the focus of this paper. The primary...

متن کامل

Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling

Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a rst step that detects sets of permutable nested loops. All algorithms developed so far consider the statements of the loop body as a single block, in other words, they are not able to take advantage of the structure of dependences between diierent statements. In this paper, we overcome this limita...

متن کامل

Parallelizing Nested Loops with Approximations of Distance Vectors: A Survey

Received (received date) Revised (revised date) Communicated by (Name of Editor) ABSTRACT In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use diierent representations of distance vectors as input. We study the optimality of each with respect to the dependence analysis it uses....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994